Intermediate Guardianship Based Routing Protocol In MANET
نویسندگان
چکیده
منابع مشابه
Swarm Intelligence Based MANET Routing Protocol
A Mobile Ad-Hoc Network (MANET) is a set of mobile nodes which communicate over radio and do not need any infrastructure. These kinds of networks are very flexible and suitable for several situations and applications, thus they allow the established temporary communication without pre installed infrastructure due to the limited transmission range of wireless interfaces communication traffic has...
متن کاملA Efficient Grid - Based MANET Routing Protocol
We propose a new reliable MANET routing protocol which uses a logical two dimensional grid. The proposed protocol is called Efficient Grid-based Routing Protocol (E-GRP). E-GRP is based on the GRID routing protocol [1]. The main new features of E-GRP compared to GRID is the ability to work with different cell sizes by giving approximately same results in term of average end-to-end delay, number...
متن کاملFuzzy Energy based Routing Protocol for MANET
The main problem concerning laptops and handheld devices is the limited battery power, their batteries lifetime have a significant impact on the performance of ad hoc networks since nodes in ad hoc networks need to relay their packets through other nodes. In this paper, fuzzy controllers take number of hops, packet queue occupancy, and remaining energy along the paths into account while picking...
متن کاملA New Method to Reduce Energy Consumption in Manet Network Routing based on OLSR Protocol and Genetic Algorithm
Mobile Ad Hoc Networks (MANET) can be considered as a class of unstructured networks created by a number of autonomous wireless and sensor nodes. The inherent characteristics of such networks have made specific applications, such as multimedia transfer and challenging. Basically, the functionality of a node and very few resources directly affect the delivery of packets which depends on the ...
متن کاملMANET with Q Routing Protocol
A Most of the routing algorithms are based on shortest path algorithms or distance vector or link state algorithms, they are not capable of adapting the run time changes such as traffic load, delivery time to reach to the destination etc, thus though provides shortest path, these shortest path may not be optimum path to deliver the packets. Optimum path can only be achieved when state of the ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2016
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-01821111115